A Description of Holland's Royal Road Function
نویسنده
چکیده
SFI WORKING PAPER: 1994-11-059 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at SFI, inspired by an invited visit to or collaboration at SFI, or funded by an SFI grant. ©NOTICE: This working paper is included by permission of the contributing author(s) as a means to ensure timely distribution of the scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the author(s). It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may be reposted only with the explicit permission of the copyright holder. www.santafe.edu
منابع مشابه
Maintaining Genetic Diversity in Genetic Algorithms through Co-evolution
This paper presents a systematic approach to co-evolution that allows concise and uniied expression of all types of symbiotic relationships studied in ecology. The resulting Linear Model of Symbiosis can be easily added to any regular Genetic Algorithm. Our model helps prevent premature convergence to a local optimum by maintaining the genetic diversity in a population. Our experiments show tha...
متن کاملIgnoble Trails - Where Crossover Is Provably Harmful
Beginning with the early days of the genetic algorithm and the schema theorem it has often been argued that the crossover operator is the more important genetic operator. The early Royal Road functions were put forth as an example where crossover would excel, yet mutation based EAs were subsequently shown to experimentally outperform GAs with crossover on these functions. Recently several new R...
متن کاملPhenotypical Building Blocks for Genetic Programming
The theoretical foundations of genetic algorithms (GA) rest on the shoulders of the Schema Theorem, which states that the building blocks, highly t compact subsets of the chromosome, are more likely to survive from one generation to the next. The theory of genetic programming (GP) is tenuous , borrowing heavily from that of GA. As the GP can be considered to be a GA operating on a tree structur...
متن کاملThe Cooperative Royal Road: Avoiding Hitchhiking
We propose using the so called Royal Road functions as test functions for cooperative co-evolutionary algorithms (CCEAs). The Royal Road functions were created in the early 90’s with the aim of demonstrating the superiority of genetic algorithms over local search methods. Unexpectedly, the opposite was found to be true. The research deepened our understanding of the phenomenon of hitchhiking wh...
متن کاملCooperative Royal Road: avoiding hitchhiking
We propose using the so called Royal Road functions as test functions for cooperative co-evolutionary algorithms (CCEAs). The Royal Road functions were created in the early 90’s with the aim of demonstrating the superiority of GAs over local search methods. Unexpectedly, the opposite was found true, but this research conducted to understanding the phenomenon of hitchhiking whereby unfavorable a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Evolutionary Computation
دوره 2 شماره
صفحات -
تاریخ انتشار 1994